With the rapid development of e-commerce and the popularity of the Internet， it is more convenient to exchange and return goods. Therefore， the customers’ demands for goods show the characteristics of timeliness， variety， small batch， exchanging and returning. Aiming at Location-Routing Problem with Simultaneous Pickup and Delivery （LRPSPD） with capacity and considering the characteristics of customers’ diversified demands， a mathematical model of LRPSPD & Time Window （LRPSPDTW） was established. Improved FireWorks Algorithm （IFWA） was used to solve the model， and the corresponding neighborhood operations were carried out for the fireworks explosion and mutation. The performance of the fireworks algorithm was evaluated with some benchmark LRPSPD examples. The correctness and effectiveness of the proposed model and algorithm were verified by a large number of numerical experiments. Experimental results show that compared with Branch and Cut algorithm （B&C）， the average error between the result of IFWA and the standard solution is reduced by 0.33 percentage points. The proposed algorithm shortens the time to find the optimal solution， and provides a new way of thinking for solving location-routing problems.

The multi-coverage will appear with the sensors of Wireless Sensor Network (WSN) being randomly and high-densely distributed on the fields that will waste the energy of sensors and the entire network. Concerning this problem, a sleeping algorithm based Voronoi diagram was improved. Sleeping sensors were estimated and the energy of the whole network cost was reduced with calculating distance of sensors and their neighbors and distance of sensors and vertex of their Voronoi diagrams. The simulation results show that the improved sleeping algorithm can save energy of the whole network, and extend the lifetime of network.